Bicriteria multiresource generalized assignment problem

In this study, we consider a bicriteria multiresource generalized assignment problem. Our criteria are the total assignment load and maximum assignment load over all agents. We aim to generate all nondominated objective vectors and the corresponding efficient solutions. We propose several lower and upper bounds and use them in our optimization and heuristic algorithms. The computational results have shown the satisfactory behaviors of our approaches. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 621–636, 2014     

Graph distance‐dependent labeling related to code assignment in computer networks

For nonnegative integers d₁, d₂, and L(d₁, d₂)‐labeling of a graph G, is a function f : V(G) → {0, 1, 2, …} such that |f(u) − f(v)| ≥ d_i whenever the distance between u and v is i in G, for i = 1, 2. The L(d₁, d₂)‐number of G, λ(G) is the smallest k such that there exists an L(d₁, d₂)‐labeling with the largest label k. These labelings have an application to a computer code assignment problem. The task is to assign integer “control codes” to a network of computer stations with distance restrictions, which allow d₁ ≤ d₂. In this article, we will study the labelings with (d₁, d₂) ∈ {(0, 1), (1, 1), (1, 2)}. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

任务划分与处理机调度的递归-分治方法

本文介绍并实现了一种如何把一个顺序执行的任务集,根据其子任务之间潜在的并行性,划分成若干个可并发执行的任务子集,并把每个子集分配给一个处理机,使各处理机之间的数据通信量尽可能地少,同时兼顾各处理机之间负载平衡的算法。最后给出了几个典型例题的试算结果,为了满足用户的不同要求,文章还提出了几点改进方法。     

多源异构战场信息关联挖掘技术研究

针对复杂战场环境对信息关联的需求,对多源异构战场信息关联挖掘技术展开研究,提出了面向时空、实体、任务、语义四种关联信息挖掘方法,实现战场信息在多个维度上的关联,使其更好的满足复杂化、多样化的战场信息感知需要。     

Exact algorithms and bounds for the dynamic assignment interdiction problem

We study a multi‐stage dynamic assignment interdiction (DAI) game in which two agents, a user and an attacker, compete in the underlying bipartite assignment graph. The user wishes to assign a set of tasks at the minimum cost, and the attacker seeks to interdict a subset of arcs to maximize the user's objective. The user assigns exactly one task per stage, and the assignment costs and interdiction impacts vary across stages. Before any stage commences in the game, the attacker can interdict arcs subject to a cardinality constraint. An interdicted arc can still be used by the user, but at an increased assignment cost. The goal is to find an optimal sequence of assignments, coupled with the attacker's optimal interdiction strategy. We prove that this problem is strongly NP‐hard, even when the attacker can interdict only one arc. We propose an exact exponential‐state dynamic‐programming algorithm for this problem as well as lower and upper bounds on the optimal objective function value. Our bounds are based on classical interdiction and robust optimization models, and on variations of the DAI game. We examine the efficiency of our algorithms and the quality of our bounds on a set of randomly generated instances. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 373–387, 2017     

基于改进鸽群优化的直升机协同目标分配

针对多直升机协同目标分配问题,建立了基于敌我相对态势的对地打击多目标的分配模型。引入多Agent系统机制,加快了有益信息在系统中的流动;并借助雁群成员在飞行中借鉴雁群整体经验的操作,来修正鸽群算法中地标算子的寻优方向,进而提出了基于多Agent的改进鸽群优化的问题求解策略。最后,以典型的直升机对地作战目标分配问题为背景,仿真验证了模型及其求解算法的合理性和有效性。     

基于改进蚁群算法的云计算任务调度研究

把改进的蚁群算法应用到云计算任务调度中,通过将任务在虚拟机上的一次分配作为蚂蚁的一次成功搜索,实现了虚拟机的负载均衡和调度时间的优化,提高云计算资源分配的效率。通过在Cloud Sim平台下进行仿真测试,结果显示,改进蚁群算法在负载均衡性能和总的任务调度时间方面均优于基本的蚁群算法。     

面向试验过程的发射场地面设备风险分析方法

针对现有风险分析方法无法较好地描述风险在系统运行过程中的分布情况,提出了面向试验过程的风险分析方法。该方法能够对系统进行全面的描述,并可以给出系统的风险事件分布。在风险识别阶段使用风险分布图和风险事件分析表,使分析人员更容易掌握系统风险分布的全局和细节,最大限度避免风险事件遗漏;在风险管理阶段使用风险分布图,将风险事件与试验过程或作业环节相联系,可以使管理人员和作业人员直观了解系统中风险存在的位置和形式,更有利于风险的控制。该方法使风险分析更接近于试验任务过程实际,更容易为工程技术人员所掌握。     

一种面向复杂地理空间栅格数据处理算法并行化的任务调度方法

随着并行计算技术的成熟,地理空间栅格数据处理算法的并行化研究成为新的热点。聚焦于处理流程包含多个计算步骤的复杂地理空间栅格数据处理算法,基于空间计算域理论,提出了一个随着算法处理流程而动态变化的任务调度方法。实验证明,该方法在算法流程的每一个计算步都会调整任务分组方案,因此相比于传统任务调度方法,任务调度的负载均衡效果更好,并行算法程序的运行时间更短。     

基于BPAF判决的决策层目标属性融合研究

在D-S证据理论框架下,研究了基于目标基本概率赋值(BPAF)判决的决策层目标属性融合问题。简要介绍了D-S证据组合理论框架,阐述了基于BPAF判决的决策层目标属性融合策略、步骤;分析了证据严重冲突时,Dempster证据组合规则不合理的本质原因;提出必须对D-S证据组合规则进行改善等需要继续深入探讨的几个问题。